Esprit IV LTR Project 21957 (CGAL) Workpackage 4, Report 1 April
نویسندگان
چکیده
منابع مشابه
Complexity of Many Cells and Sum of Squares of Cell Complexities in Hyperplane Arrangements Too long
Let H be a collection of n hyperplanes in d-space. We will assume that the planes are in general position, meaning that any k planes meet in a d− k-flat, if k = 1, . . . , d, and not at all if k > d. It is not difficult to see that worst-case cell complexity can always be achieved by planes in general position. comBoris says: True, or only asymptotically true?ment Let P be ←− Work on this paper...
متن کاملOn the Area Bisectors of a Polygon* R --i
We consider the family of lines that are area bisectors of a polygon (possibly with holes) in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce different partitionings of the vertices of P. We derive an algebraic characterization of area bisectors. We then show that there are simple polygons with II vertices that have R (n*) combinatorially distinct...
متن کاملOn Cell Complexities in Hyperplane Arrangements
Let H be a collection of n hyperplanes in d-space. We will assume that the planes are in general position, meaning that any k planes meet in a d− k-flat, if k = 1, . . . , d, and not at all if k > d. It is not difficult to see that worst-case cell complexity can always be achieved by planes in general position. Let P be a set of m points, not lying on any hyperplane. Denote by K (d) j (P,H) the...
متن کاملOn the Area Bisectors of a Polygon
We consider the family of lines that are area bisectors of a polygon (possibly with holes) in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di erent partitionings of the vertices of P . We derive an algebraic characterization of area bisectors. We then show that there are simple polygons with n vertices that have (n) combinatorially distinct are...
متن کاملOn Deletion in Delaunay Triangulation
This paper present how space of spheres and shelling can be used to delete e ciently a point from d-dimensional triangulation. In 2-dimension, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times. This algorithm can be viewed as a variation of H...
متن کامل